Convergence of maximum bisection ratio of sparse random graphs
نویسندگان
چکیده
منابع مشابه
Bisection of Random Cubic Graphs
We present two randomized algorithms to bound the bisection width of random n-vertex cubic graphs. We obtain an asymptotic upper bound for the bisection width of 0.174039n and a corresponding lower bound of 1.325961n. The analysis is based on the differential equation method.
متن کاملMaximum matchings in sparse random graphs: Karp-Sipser revisited
We study the average performance of a simple greedy algorithm for nding a matching in a sparse random graph G n;c=n , where c > 0 is constant. The algorithm was rst proposed by Karp and Sipser 12]. We give signiicantly improved estimates of the errors made by the algorithm. For the sub-critical case where c < e we show that the algorithm nds a maximum matching with high probability. If c > e th...
متن کاملSampling Random Colorings of Sparse Random Graphs
We study the mixing properties of the single-site Markov chain known as the Glauber dynam-ics for sampling k-colorings of a sparse random graph G(n, d/n) for constant d. The best knownrapid mixing results for general graphs are in terms of the maximum degree ∆ of the input graphG and hold when k > 11∆/6 for all G. Improved results hold when k > α∆ for graphs withgirth ≥ 5 and ∆ ...
متن کاملA conjecture on the maximum cut and bisection width in random regular graphs
The asymptotic properties of random regular graphs are objects of extensive study in mathematics and physics. In this paper we argue, using the theory of spin glasses in physics, that in random regular graphs the maximum cut size asymptotically equals the number of edges in the graph minus the minimum bisection size. Maximum cut and minimal bisection are two famous NP-complete problems with no ...
متن کاملBisecting sparse random graphs
Consider partitions of the vertex set of a graph G into two sets with sizes differing by at most 1: the bisection width of G is the minimum over all such partitions of the number of ‘‘cross edges’’ between the parts. We are interested in sparse random graphs Ž . G with edge probability c n. We show that, if c ln 4, then the bisection width is n n, c n with high probability; while if c ln 4, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2018
ISSN: 1083-589X
DOI: 10.1214/18-ecp164